*****************************************************************************
                     Task identifier - gao_00000.DEME01
*****************************************************************************
> Start of solving the task "gao_00000.DEME01":  9:16:47 (time), 05.08.2018 (date).
-----------------------------------------------------------------------------
1. It is the end of a stage of task data input. Number of variants of a threshold to restrict time of executing the network graph of 1 chains of operations - 5.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 1 ***
2. It is the end of a stage of formation of DSP phase states array, number of which equals 429, for 1-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
3. It is the end of a stage of formation of controls arrays and step losses arrays for 1-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
4. It is the end of numerical optimization stage for 1-th of 5 variants of a restriction threshold and 1-th chain of operations. Number of optimization cycles - 335.
    !!! OPTIMAL STRATEGY IS FOUND for 1-th of 5 variants of a threshold to restrict executon of all network graph of  1 chains of operations.
         Minimum calculated cost of executing the network graph - 4425000,00 monet.units at a time threshold of restriction - 900,00 time units
5. It is the end of a stage of formation of optimal output data for 1-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 2 ***
2. It is the end of a stage of formation of DSP phase states array, number of which equals 499, for 2-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
3. It is the end of a stage of formation of controls arrays and step losses arrays for 2-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
4. It is the end of numerical optimization stage for 2-th of 5 variants of a restriction threshold and 1-th chain of operations. Number of optimization cycles - 335.
    !!! OPTIMAL STRATEGY IS FOUND for 2-th of 5 variants of a threshold to restrict executon of all network graph of  1 chains of operations.
         Minimum calculated cost of executing the network graph - 3870000,00 monet.units at a time threshold of restriction - 1050,00 time units
5. It is the end of a stage of formation of optimal output data for 2-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 3 ***
2. It is the end of a stage of formation of DSP phase states array, number of which equals 604, for 3-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
3. It is the end of a stage of formation of controls arrays and step losses arrays for 3-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
4. It is the end of numerical optimization stage for 3-th of 5 variants of a restriction threshold and 1-th chain of operations. Number of optimization cycles - 335.
    !!! OPTIMAL STRATEGY IS FOUND for 3-th of 5 variants of a threshold to restrict executon of all network graph of  1 chains of operations.
         Minimum calculated cost of executing the network graph - 3330000,00 monet.units at a time threshold of restriction - 1275,00 time units
5. It is the end of a stage of formation of optimal output data for 3-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 4 ***
2. It is the end of a stage of formation of DSP phase states array, number of which equals 709, for 4-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
3. It is the end of a stage of formation of controls arrays and step losses arrays for 4-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
4. It is the end of numerical optimization stage for 4-th of 5 variants of a restriction threshold and 1-th chain of operations. Number of optimization cycles - 335.
    !!! OPTIMAL STRATEGY IS FOUND for 4-th of 5 variants of a threshold to restrict executon of all network graph of  1 chains of operations.
         Minimum calculated cost of executing the network graph - 3000000,00 monet.units at a time threshold of restriction - 1500,00 time units
5. It is the end of a stage of formation of optimal output data for 4-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
-----------------------------------------------------------------------------
                 *** Variant of task calculation - 5 ***
2. It is the end of a stage of formation of DSP phase states array, number of which equals 751, for 5-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
3. It is the end of a stage of formation of controls arrays and step losses arrays for 5-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
4. It is the end of numerical optimization stage for 5-th of 5 variants of a restriction threshold and 1-th chain of operations. Number of optimization cycles - 335.
    !!! OPTIMAL STRATEGY IS FOUND for 5-th of 5 variants of a threshold to restrict executon of all network graph of  1 chains of operations.
         Minimum calculated cost of executing the network graph - 2880000,00 monet.units at a time threshold of restriction - 1590,00 time units
5. It is the end of a stage of formation of optimal output data for 5-th of 5 variants of a threshold to restrict execution of 1-th of 1 chains of operations of the network graph.
-----------------------------------------------------------------------------
6. It is the end of a final stage of solving the task "gao_00000.DEME01", consisting in forming the output data file for 5 of set variants of a restriction threshold.
-----------------------------------------------------------------------------
> Duration of solving the task "gao_00000.DEME01" - 0:00:00.
===================================================

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////

